OpenACC Based GPU Parallelization of Plane Sweep Algorithm for Geometric Intersection

Line segment intersection is one of the elementary operations in computational geometry. Complex problems in Geographic Information Systems (GIS) like finding map overlays or spatial joins using polygonal data require solving segment intersections. Plane sweep paradigm is used for finding geometric intersection in an efficient manner. However, it is difficult to parallelize due to its in-order processing of spatial events. We present a new fine-grained parallel algorithm for geometric intersection and its CPU and GPU implementation using OpenMP and OpenACC. To the best of our knowledge, this is the first work demonstrating an effective parallelization of plane sweep on GPUs. We chose compiler directive based approach for implementation because of its simplicity to parallelize sequential code. Using Nvidia Tesla P100 GPU, our implementation achieves around 40X speedup for line segment intersection problem on 40K and 80K data sets compared to sequential CGAL library

Solving kk-means on High-dimensional Big Data

In recent years, there have been major efforts to develop data stream algorithms that process inputs in one pass over the data with little memory requirement. For the $k$-means problem, this has led to the development of several $(1+\varepsilon)$-approximations (under the assumption that $k$ is a constant), but also to the design of algorithms that are extremely fast in practice and compute solutions of high accuracy. However, when not only the length of the stream is high but also the dimensionality of the input points, then current methods reach their limits. We propose two algorithms, piecy and piecy-mr that are based on the recently developed data stream algorithm BICO that can process high dimensional data in one pass and output a solution of high quality. While piecy is suited for high dimensional data with a medium number of points, piecy-mr is meant for high dimensional data that comes in a very long stream. We provide an extensive experimental study to evaluate piecy and piecy-mr that shows the strength of the new algorithms.Comment: 23 pages, 9 figures, published at the 14th International Symposium on Experimental Algorithms - SEA 201

Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles

In this paper we study two geometric data structure problems in the special case when input objects or queries are fat rectangles. We show that in this case a significant improvement compared to the general case can be achieved. We describe data structures that answer two- and three-dimensional orthogonal range reporting queries in the case when the query range is a \emph{fat} rectangle. Our two-dimensional data structure uses $O(n)$ words and supports queries in $O(\log\log U +k)$ time, where $n$ is the number of points in the data structure, $U$ is the size of the universe and $k$ is the number of points in the query range. Our three-dimensional data structure needs $O(n\log^{\varepsilon}U)$ words of space and answers queries in $O(\log \log U + k)$ time. We also consider the rectangle stabbing problem on a set of three-dimensional fat rectangles. Our data structure uses $O(n)$ space and answers stabbing queries in $O(\log U\log\log U +k)$ time.Comment: extended version of a WADS'19 pape

Reconstituting typeset Marriage Registers using simple software tools

In a world of fully integrated software applications, which can seem daunting to develop and to maintain, it is sometimes useful to recall that a system of loosely-linked software components can provide surprisingly powerful and flexible methods for software development. This paper describes a project which aims to retypeset a series of volumes from the Phillimore Marriage Registers, first published in England around the turn of the last century. The source material is plain text derived from running Optical Character Recognition (OCR) on a set of page scans taken from the original printed volumes. The regular, tabular, structure of the Register pages allows us to automate the re-typesetting process. The UNIX troff software and its tbl preprocessor are used for the typesetting itself, but a series of simple awk-based software tools, all of them parsers and code generators of one sort or another, is used to bring about the OCR-to-troff transformation. By re-parsing the generated troff codes it is possible to produce a surname index as a supplement to the retypeset volume. Moreover, this second-stage parsing has been invaluable in discovering subtle ‘typos’ in the automatically generated material. With small adjustments to this parser it would be possible to output the complete marriage entries in standard XML or GEDCOM notations

Faster subsequence recognition in compressed strings

Computation on compressed strings is one of the key approaches to processing massive data sets. We consider local subsequence recognition problems on strings compressed by straight-line programs (SLP), which is closely related to Lempel--Ziv compression. For an SLP-compressed text of length $\bar m$, and an uncompressed pattern of length $n$, C{\'e}gielski et al. gave an algorithm for local subsequence recognition running in time $O(\bar mn^2 \log n)$. We improve the running time to $O(\bar mn^{1.5})$. Our algorithm can also be used to compute the longest common subsequence between a compressed text and an uncompressed pattern in time $O(\bar mn^{1.5})$; the same problem with a compressed pattern is known to be NP-hard

Modelling India’s coal production with a negatively skewed curve-fitting model

India’s coal demand is forecast to increase at a rapid pace in the future due to the country’s economic and population growth. Analyzing the scope for future production of India’s domestic coal resources, therefore, plays a vital role in the country’s development of sound energy policies. This paper presents a quantitative scenario analysis of India’s potential future coal production by using a negatively skewed curve-fitting model and a range of estimates of the country’s ultimately recoverable resources (URR) of coal. The results show that the resource base is sufficient for India’s coal production to keep increasing over the next few decades, to reach between 2400 and 3200 Mt/y at 2050, depending on the assumed value of URR. A further analysis shows that the high end of this range, which corresponds to our ‘GSI’ scenario, can be considered as the probable upper-bound to India’s domestic coal production. Comparison of production based on the ‘GSI’ scenario with India’s predicted demand shows that the domestic production of coal will be insufficient to meet the country’s rising coal demand, with the gap between demand and production increasing from its current value of about 268 Mt/y to reach 300 Mt/y in 2035, and 700 Mt/y by 2050. This increasing gap will be challenging for the energy security of India

Nutritional status and the gonadotrophic response to a polar expedition.

Polar expeditions have been associated with changes in the hypothalamic-pituitary-testicular axis consistent with central hypogonadism (i.e., decreased testosterone, luteinising hormone (LH), and follicle stimulating hormone (FSH)). These changes are typically associated with body mass loss. Our aim was to evaluate whether maintenance of body mass during a polar expedition could mitigate against the development of central hypogonadism. Male participants (n = 22) from a 42-day expedition (British Services Antarctic Expedition 2012) volunteered to take part in the study. Body mass, body composition, and strength data were recorded pre- and postexpedition in addition to assessment of serum testosterone, LH, FSH, thyroid hormones, insulin-like growth factor 1 (IGF-1), and trace elements. Energy provision and energy expenditure were assessed at mid- and end-expedition. Daily energy provision was 6335 ± 149 kcal·day(-1). Estimated energy expenditure midexpedition was 5783 ± 1690 kcal·day(-1). Body mass and percentage body fat did not change between pre- and postexpedition. Total testosterone (nmol·L(-1)) (14.0 ± 4.9 vs. 17.3 ± 4.0, p = 0.006), calculated free testosterone (pmol·L(-1)) (288 ± 82 vs. 350 ± 70, p = 0.003), and sex hormone binding globulin (nmol·L(-1)) (33 ± 12 vs. 36 ± 11, p = 0.023) concentrations increased. LH and FSH remained unchanged. Thyroid stimulating hormone (TSH; IU·L(-1)) (2.1 ± 0.8 vs. 4.1 ± 2.1, p < 0.001) and free triiodothyronine (FT3; IU·L(-1)) (5.4 ± 0.4 vs. 6.1 ± 0.8, p < 0.001) increased while free thyroxine, IGF-1, and trace elements remained unchanged. Hand-grip strength was reduced postexpedition but static lift strength was maintained. Maintenance of body mass and nutritional status appeared to negate the central hypogonadism previously reported from polar expeditions. The elevated TSH and free FT3 were consistent with a previously reported "polar T3 syndrome"

Modeling the evolution space of breakage fusion bridge cycles with a stochastic folding process

Breakage-Fusion-Bridge cycles in cancer arise when a broken segment of DNA is duplicated and an end from each copy joined together. This structure then 'unfolds' into a new piece of palindromic DNA. This is one mechanism responsible for the localised amplicons observed in cancer genome data. The process has parallels with paper folding sequences that arise when a piece of paper is folded several times and then unfolded. Here we adapt such methods to study the breakage-fusion-bridge structures in detail. We firstly consider discrete representations of this space with 2-d trees to demonstrate that there are 2^(n(n-1)/2) qualitatively distinct evolutions involving n breakage-fusion-bridge cycles. Secondly we consider the stochastic nature of the fold positions, to determine evolution likelihoods, and also describe how amplicons become localised. Finally we highlight these methods by inferring the evolution of breakage-fusion-bridge cycles with data from primary tissue cancer samples

Designing a physical activity parenting course : parental views on recruitment, content and delivery

Background Many children do not engage in sufficient levels of physical activity (PA) and spend too much time screen-viewing (SV). High levels of SV (e.g. watching TV, playing video games and surfing the internet) and low levels of PA have been associated with adverse health outcomes. Parenting courses may hold promise as an intervention medium to change children’s PA and SV. The current study was formative work conducted to design a new parenting programme to increase children’s PA and reduce their SV. Specifically, we focussed on interest in a course, desired content and delivery style, barriers and facilitators to participation and opinions on control group provision. Methods In-depth telephone interviews were conducted with thirty two parents (29 female) of 6–8 year olds. Data were analysed thematically. An anonymous online survey was also completed by 750 parents of 6–8 year old children and descriptive statistics calculated. Results Interview participants were interested in a parenting course because they wanted general parenting advice and ideas to help their children be physically active. Parents indicated that they would benefit from knowing how to quantify their child’s PA and SV levels. Parents wanted practical ideas of alternatives to SV. Most parents would be unable to attend unless childcare was provided. Schools were perceived to be a trusted source of information about parenting courses and the optimal recruitment location. In terms of delivery style, the majority of parents stated they would prefer a group-based approach that provided opportunities for peer learning and support with professional input. Survey participants reported the timing of classes and the provision of childcare were essential factors that would affect participation. In terms of designing an intervention, the most preferred control group option was the opportunity to attend the same course at a later date. Conclusions Parents are interested in PA/SV parenting courses but the provision of child care is essential for attendance. Recruitment is likely to be facilitated via trusted sources. Parents want practical advice on how to overcome barriers and suggest advice is provided in a mutually supportive group experience with expert input